On Approximating Polynomial-Quadratic Regulator Problems

نویسندگان

چکیده

Feedback control problems involving autonomous polynomial systems are prevalent, yet there limited algorithms and software for approximating their solution. This paper represents a step forward by considering the special case of regulator problem where state equation has nonlinearity, costs quadratic, feedback is approximated low-degree polynomials. As this natural extension linear-quadratic (LQR) quadratic-quadratic (QQR) problems, we denote class as polynomial-quadratic (PQR) problems. The present approach amenable to approximations with low degree polynomials modest model dimension. setting can be achieved in many using modern reduction methods. Al’Brekht algorithm, when applied nonlinearities represented Kronecker products leads an elegant formulation. terms lead large linear that effectively solved N-way generalization Bartels-Stewart algorithm. We demonstrate our algorithm numerical examples include Lorenz equations, ring van der Pol oscillators, discretized version Burgers equation. described here available on Github.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

In this paperwe study semidefinite programming (SDP)models for a class of discrete and continuous quadratic optimization problems in the complex Hermitian form. These problems capture a class of well-known combinatorial optimization problems, as well as problems in control theory. For instance, they include theMAX-3-CUT problem where the Laplacian matrix is positive semidefinite (in particular,...

متن کامل

Approximating Min-Max (Regret) Versions of Some Polynomial Problems

While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies about their approximation. For a bounded number of scenarios, we establish a general approximation scheme which can be used for min-max and min-max regret versions of some polynomial problems. Applying this scheme to short...

متن کامل

Approximating the Distributions of Singular Quadratic Expressions and their Ratios

Noncentral indefinite quadratic expressions in possibly non- singular normal vectors are represented in terms of the difference of two positive definite quadratic forms and an independently distributed linear combination of standard normal random variables. This result also ap- plies to quadratic forms in singular normal vectors for which no general representation is currently available. The ...

متن کامل

On Approximating the Entropy of Polynomial Mappings

We investigate the complexity of the following computational problem: POLYNOMIAL ENTROPY APPROXIMATION (PEA): Given a low-degree polynomial mapping p : F → F, where F is a finite field, approximate the output entropy H(p(Un)), where Un is the uniform distribution on F and H may be any of several entropy measures. We show: • Approximating the Shannon entropy of degree 3 polynomials p : F2 → F2 o...

متن کامل

Approximating the Chromatic Polynomial

Chromatic polynomials are important objects in graph theory and statistical physics, but as a result of computational difficulties, their study is limited to graphs that are small, highly structured, or very sparse. We have devised and implemented two algorithms that approximate the coefficients of the chromatic polynomial P (G,x), where P (G, k) is the number of proper k-colorings of a graph G...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2021

ISSN: ['2405-8963', '2405-8971']

DOI: https://doi.org/10.1016/j.ifacol.2021.06.090